Joan Feigenbaum - PDFSEARCH.IO - Document Search Engine

Joan Feigenbaum
Results: 82

#	Item
41	Subjective-Cost Policy Routing ⋆ Joan Feigenbaum a,1 a Yale University Computer Science Department, 51 Prospect St., New Haven, CT 06511, USA. Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2008-02-16 15:53:17 Routing algorithms Link-state routing protocol Routing Shortest path problem Multipath routing Wireless Routing Protocol
42	Dirk Bergemann Joan Feigenbaum Yale University Economics and Computation Computer Scienceand Economics Add to Reading List Source URL: zoo.cs.yale.edu Language: English - Date: 2008-11-13 18:52:38 Marketing Recommender system Reputation system Economic equilibrium Richard Zeckhauser Utility Value
43	Towards a Theory of Networked Computation Joan Feigenbaum Michael Mitzenmacher Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2009-07-20 13:13:30 Cybernetics Network theory Distributed computing Theory of computation Computer science Computing Computation Network science Actor model Theoretical computer science Networked learning
44	Distributed Computing manuscript No. (will be inserted by the editor) Joan Feigenbaum · Rahul Sami · Scott Shenker Mechanism Design for Policy Routing Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2005-10-15 13:14:00 Routing protocols Routing algorithms Network theory Routing Border Gateway Protocol Shortest path problem Link-state routing protocol Contraction hierarchies
45	DEBAYAN GUPTA work.debayangupta.com \| 51 Prospect St, New Haven, CT 06511, USA \| (+ \| EDUCATION YALE UNIVERSITY \| NEW HAVEN, CT, USA Add to Reading List Source URL: debayangupta.com Language: English - Date: 2016-03-10 21:03:12 Joan Feigenbaum Feigenbaum Computer science
46	Economics and Computation ECONand CPSCProfessor Dirk Bergemann and Professor Joan Feigenbaum Lecture IV Add to Reading List Source URL: zoo.cs.yale.edu Language: English - Date: 2008-10-07 04:07:53 Complexity classes Computational complexity theory Boolean algebra Structural complexity theory NP-complete problems Boolean satisfiability problem NP PP Reduction True quantified Boolean formula Exponential time hypothesis P
47	Economics and Computation CPSCEcon, Fall 2011 Time: Tu & Th, 2:30-3:45 pm Room: AKW 200 http://zoo.cs.yale.edu/classes/cs455/fall11/ 1 Add to Reading List Source URL: zoo.cs.yale.edu Language: English - Date: 2011-10-10 00:08:12
48	Towards Realistic Assumptions, Models, and Goals for Security Research (White Paper for NSF Workshop) Joan Feigenbaum Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2002-05-22 10:45:19 Privacy Data security Copyright law Cryptography Identity management P3P Digital rights management Personally identifiable information Internet privacy Digital Copyright Digital Millennium Copyright Act Information security
49	1 Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2001-10-24 10:52:24 Complexity classes PSPACE-complete IP Generalized geography PSPACE PP ArthurMerlin protocol Computational complexity theory NP P NEXPTIME Reduction
50	Systematizing Secure Computation for Research and Decision Support Jason Perry, Debayan Gupta, Joan Feigenbaum and Rebecca N. Wright Rutgers University, Yale University Add to Reading List Source URL: paul.rutgers.edu Language: English - Date: 2014-09-07 12:36:30 Cryptography Secure multi-party computation Secret sharing Cryptographic protocol Communications protocol

UPDATE